منابع مشابه
Partition of a graph into cycles and isolated vertices
Let k, r, n be integers with k ≥ 2, 0 ≤ r ≤ k−1 and n ≥ 10k+3. We prove that if G is a graph of order n such that the degree sum of any pair of nonadjacent vertices is at least n−r, then G contains k vertexdisjoint subgraphs Hi, 1 ≤ i ≤ k, such that V (H1) ∪ . . . ∪ V (Hk) = V (G) and such that Hi is a cycle or isomorphic to K1 for each i with 1 ≤ i ≤ r, and Hi is a cycle for each i with r + 1 ...
متن کاملDegree conditions for the partition of a graph into cycles, edges and isolated vertices
Let k, n be integers with 2 ≤ k ≤ n, and let G be a graph of order n. We prove that if max{dG(x), dG(y)} ≥ (n − k + 1)/2 for any x, y ∈ V (G) with x = y and xy / ∈ E(G), then G can be partitioned into k subgraphs H1, . . . ,Hk such that Hi is a cycle or K1 or K2 for each 1 ≤ i ≤ k unless k = 2 and G = C5 or k = 3 and G = K1 ∪ C5.
متن کاملCovering a bipartite graph with cycles passing through given edges
We propose a conjecture: for each integer k 2:: 2, there exists N (k) such that if G = (Vb \12; E) is a bipartite graph with IV11 = 1\121 = n 2: N(k) and d( x) + d(y) 2: n + k for each pair of non-adjacent vertices x and y of G with x E V1 and y E \12, then for any k independent edges el, ... , ek of G, there exist k vertex-disjoint cycles G1, ... , Gk in G such that ei E E(Gi ) for all i E {I,...
متن کاملDecomposing Dense Bipartite Graphs into 4-Cycles
Let G be an even bipartite graph with partite sets X and Y such that |Y | is even and the minimum degree of a vertex in Y is at least 95|X|/96. Suppose furthermore that the number of edges in G is divisible by 4. Then G decomposes into 4-cycles.
متن کاملVertex-disjoint cycles containing specified edges in a bipartite graph
Dirac and Ore-type degree conditions are given for a bipartite graph to contain vertex disjoint cycles each of which contains a previously specified edge. This solves a conjecture of Wang in [6].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1993
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90345-t